Finite-state adaptive block to variable-length noiseless coding of a nonstationary information source
نویسنده
چکیده
1259 Ahsfracf-We associate with a given nonstationary finite-alphabet information source a certain class of stationary processes which we term the stationary hull of the given source. It is then shown that the optimum average rate at which the given source can be noiselessly coded via finite-state adaptive block to variable-length coding schemes is the largest entropy rate among those processes in the stationary hull.
منابع مشابه
Efficient universal noiseless source codes
Although the existence of universal noiseless variable-rate codes for the class of discrete stationary ergodic sources has previously been established, very few practical universal encoding methods are available. Efficient implementable universal source coding techniques are discussed in this paper. Results are presented on source codes for which a small value of the maximum redundancy is achie...
متن کاملUniversal coding with minimum probability of codeword length overflow
-Lossless block-to-variable length source coding is studied for finite-state, finite-alphabet sources. We aim to minimize the probability that the normalized length of the codeword will exceed a given threshold B, subject to the Kraft inequality. It is shown that the Lempel-Ziv (LZ) algorithm asymptotically attains the optimal performance in the sense just defined, independently of the source a...
متن کاملUniversal noiseless coding
A&ruct-Universal coding is any asymptotically opt imum method of block-to-block memoryless source coding for sources with unknown parameters. This paper considers noiseless coding for such sources, primarily in terms of variable-length coding, with performance measured as a function of the coding redundancy relative to the per-letter conditional source entropy given the unknown parameter. It is...
متن کاملA vector quantization approach to universal noiseless coding and quantization
A two-stage code is a block code in which each block of data is coded in two stages: the first stage codes the identity of a block code among a collection of codes, and the second stage codes the data using the identified code. The collection of codes may be noiseless codes, fixed-rate quantizers, or variable-rate quantizers. We take a vector quantization approach to two-stage coding, in which ...
متن کاملA Vector Quantization Approach to Universal Noiseless Coding and Quantization - Information Theory, IEEE Transactions on
A two-stage code is a block code in which each block of data is coded in two stages: the first stage codes the identity of a block code among a collection of codes, and the second stage codes the data using the identified code. The collection of codes may he noiseless codes, fixed-rate quantizers, or variable-rate quantizers. We take a vector quantization approach to twostage coding, in which t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEEE Trans. Information Theory
دوره 35 شماره
صفحات -
تاریخ انتشار 1989